Sparse Hypergraphs with Applications to Coding Theory

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Sparse hypergraphs with applications in combinatorial rigidity

A hypergraph H = (V,E) is called (1, k)-sparse, for some integer k, if each subset X ⊆ V with |X| ≥ k spans at most |X| − k hyperedges. If we also have |E| = |V | − k then H is (1, k)-tight. Hypergraphs of this kind occur in several problems of combinatorial rigidity, where the goal is to analyse the generic rigidity properties of point sets equipped with geometric constraints involving subsets...

متن کامل

Exponential Family Sparse Coding with Applications to Self-taught Learning

Sparse coding is an unsupervised learning algorithm for finding concise, slightly higher-level representations of inputs, and has been successfully applied to self-taught learning, where the goal is to use unlabeled data to help on a supervised learning task, even if the unlabeled data cannot be associated with the labels of the supervised task [Raina et al., 2007]. However, sparse coding uses ...

متن کامل

Coloring Sparse Hypergraphs

Fix k ≥ 3, and let G be a k-uniform hypergraph with maximum degree ∆. Suppose that for each l = 2, . . . , k − 1, every set of l vertices of G is in at most ∆ k−l k−1 /f edges. Then the chromatic number of G is O(( ∆ log f ) 1 k−1 ). This extends results of Frieze and the second author [10] and Bennett and Bohman [2]. A similar result is proved for 3-uniform hypergraphs where every vertex lies ...

متن کامل

Sparse hypergraphs with low independence number

Let K (3) 4 denote the complete 3-uniform hypergraph on 4 vertices. Ajtai, Erdős, Komlós, and Szemerédi (1981) asked if there is a function ω(d) → ∞ such that every 3-uniform, K (3) 4 -free hypergraph H with N vertices and average degree d has independence number at least N d1/2 ω(d). We answer this question by constructing a 3-uniform, K (3) 4 -free hypergraph with independence number at most ...

متن کامل

Applications of subordination theory to starlike functions

Let $p$ be an analytic function defined on the open unit disc $mathbb{D}$ with $p(0)=1.$ The conditions on $alpha$ and $beta$ are derived for $p(z)$ to be subordinate to $1+4z/3+2z^{2}/3=:varphi_{C}(z)$ when $(1-alpha)p(z)+alpha p^{2}(z)+beta zp'(z)/p(z)$ is subordinate to $e^{z}$. Similar problems were investigated for $p(z)$ to lie in a region bounded by lemniscate of Bernoulli $|w^{2}-1|=1$ ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: SIAM Journal on Discrete Mathematics

سال: 2020

ISSN: 0895-4801,1095-7146

DOI: 10.1137/19m1248108